A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs

نویسنده

  • Karl Heuer
چکیده

Among the well-known sufficient degree conditions for the Hamiltonicity of a finite graph, the condition of Asratian and Khachatrian is the weakest and thus gives the strongest result. Diestel conjectured that it should extend to locally finite infinite graphs G, in that the same condition implies that the Freudenthal compactification of G contains a circle through all its vertices and ends. We prove Diestel’s conjecture for claw-free graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A sufficient condition for Hamiltonicity in locally finite graphs

Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives a sufficient condition for Hamiltonicity in locally finite graphs.

متن کامل

Claw-free graphs - A survey

In this paper we summarize known results on claw-free graphs. The paper is subdivided into the following chapters and sections: 1. Introduction 2. Paths, cycles, hamiltonicity a) Preliminaries b) Degree and neighborhood conditions c) Local connectivity conditions d) Further forbidden subgraphs e) Invariants f) Squares g) Regular graphs h) Other hamiltonicity related results and generalizations ...

متن کامل

On a Closure Concept in Claw-Free Graphs

If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in G and in cl(G) is the same. A suucient condition for hamiltonicity in claw-free graphs, the equivalence of some conjectures on hamiltonicity in 2-tough graphs and the hamiltonicity of 7-connected c...

متن کامل

Recent research in Graph Theory

A well-known and fundamental property of graphs is Hamiltonicity. A connected graph is Hamiltonian if it contains a spanning cycle. Determining if a graph is Hamiltonian is known as a NP-complete problem and no satisfactory characterization exists. Nevertheless, many sufficient conditions for Hamiltonicity were found, usually expressed in terms of degree, connectivity, density, toughness, indep...

متن کامل

Remarks on Partially Square Graphs, Hamiltonicity and Circumference

Given a graph G, its partially square graph G∗ is a graph obtained by adding an edge (u, v) for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition NG(x) ⊆ NG[u] ∪ NG[v], where NG[x] = NG(x) ∪ {x}. In the case where G is a claw-free graph, G∗ is equal to G. We define σ◦ t = min{ ∑ x∈S dG(x) : S is an independent set in G ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2016